On Orthogonality of Latin Squares
نویسندگان
چکیده
Abstract: A Latin square arrangement is an arrangement of s symbols in s rows and s columns, such that every symbol occurs once in each row and each column. When two Latin squares of same order superimposed on one another, then in the resultant array every ordered pair of symbols occurs exactly once, then the two Latin squares are said to be orthogonal. A frequency square M of type F (n; λ) is an n x n, matrix over an m-set S, where n=mλ, such that every element of S occurs exactly λ times in each row and each column of M. Two frequency squares of the same type over S are orthogonal if one is superimposed on the other each element of S x S appears λ times. These two concepts lead to a third concept that is if t-orthogonal Latin squares of order n, from a set S of Latin squares, are superimposed, then in the resultant array, each t-tuple occurs exactly once. If at all it is possible then how to construct them and that is the genesis of the paper. In this paper while generating Latin square (Latin rectangles), a new concept called t-orthogonality over the set of Latin structure has been discussed and their constructions have been given. Mathematics Subject Classification: 05B05
منابع مشابه
Generalized latin squares I
The classical definition of Latin squares is generalized by allowing multiple occurrences of symbols in each row and each column. A perfect (k, I)-Latin square is an N x N array in which any row or column contains every distinct symbol and the symbol at position (i, j) appears exactly k times in the ith row and I times in the jth column, or vice versa. Existence of such squares and the notion o...
متن کاملCertain t-partite graphs
By making use of the generalized concept of orthogonality in Latin squares, certain t-partite graphs have been constructed and a suggestion for a net work system has been made.
متن کاملNumerical Enumeration of Greco-Latin Prime Order Associative Magic Squares
A magic square of order n consists of the numbers 1 to n placed such that the sum of each row, column and principal diagonal equals the magic sum n(n +1)/2. In addition, an odd ordered magic square is associative or self-complementary if diagonally opposite elements have the same sum (n +1)/2. The magic square is said to be regular Greco-Latin if it can be decomposed as a sum of a pair of Latin...
متن کاملEnumeration of isomorphism classes of self-orthogonal Latin squares
The numbers of distinct self-orthogonal Latin squares (SOLS) and idempotent SOLS have been enumerated for orders up to and including 9. The isomorphism classes of idempotent SOLS have also been enumerated for these orders. However, the enumeration of the isomorphism classes of non-idempotent SOLS is still an open problem. By utilising the automorphism groups of class representatives from the al...
متن کاملA class of orthogonal latin square graphs
An orthogonal latin square graph is a graph whose vertices are latin squares of the same order, adjacency being synonymous with orthogonality. We are interested in orthogonal latin square graphs in which each square is orthogonal to the Cayley table M of a group G and is obtained from M by permuting columns. These permutations, regarded as permutations of G, are orthomorphisms of G and the grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0604041 شماره
صفحات -
تاریخ انتشار 2006